Constraint programming over nonlinear constraints
نویسندگان
چکیده
منابع مشابه
Newton - Constraint Programming over Nonlinear Constraints
This paper is an introduction to Newton, a constraint programming language over nonlinear real constraints. Newton originates from an effort to reconcile the declarative nature of constraint logic programming (CLP) languages over intervals with advanced interval tcchniqucs dcvclopcd in numerical analysis, such as the interval Newton method. Its key conceptual idea is to introduce the notion of ...
متن کاملConstraint Qualifications for Nonlinear Programming
This paper deals with optimality conditions to solve nonlinear programming problems. The classical Karush-Kuhn-Tucker (KKT) optimality conditions are demonstrated through a cone approach, using the well known Farkas’ Lemma. These conditions are valid at a minimizer of a nonlinear programming problem if a constraint qualification is satisfied. First we prove the KKT theorem supposing the equalit...
متن کاملFinite Domain Constraints in Constraint Logic Programming
We describe the techniques used in finite domain contraint solvers in the Constraint Logic Programming (CLP) paradigm and present the language and system clp(FD) developped at INRIA. These schemes are based on local propagation techniques developed for finite domain constraints. Such techniques stem from Constraint Satisfaction Problems in Artificial Intelligence and have been introduced in Con...
متن کاملIntegrity constraints and constraint logic programming
It is shown that constraint logic is useful for evaluation of integrity constraints in deductive databases. Integrity constraints are represented as calls to a meta-interpreter for negation-as-failure implemented as a constraint solver. This procedure, called lazy negation-as-failure, yields an incremental evaluation: It starts checking the existing database and each time an update request occu...
متن کاملConstraint Satisfaction over Generalized Staircase Constraints
One of the key research interests in the area of Constraint Satisfaction Problem (CSP) is to identify tractable classes of constraints and develop efficient solutions for them. In this paper, we introduce generalized staircase (GS) constraints which is an important generalization of one such tractable class found in the literature, namely, staircase constraints. GS constraints are of two kinds,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 1998
ISSN: 0167-6423
DOI: 10.1016/s0167-6423(97)00008-7